Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
نویسندگان
چکیده
We correct an error in Lemma 4.2 of [Kanzow and Nagel, Semidefinite programs: New search directions, smoothing-type methods, and numerical results, SIAM J. Optim 13, 2003, pp. 1–23]. With this correction, all results in that paper remain true.
منابع مشابه
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Exploiting these characterizations, some smoothing-type methods for the solution of semidefinite programs are derived. The search directions generated by these methods are automatically symmetric, and the overall method...
متن کاملNon-Interior continuation methods for solving semidefinite complementarity problems
There recently has been much interest in non-interior continuation/smoothing methods for solving linear/nonlinear complementarity problems. We describe extensions of such methods to complementarity problems defined over the cone of block-diagonal symmetric positive semidefinite real matrices. These extensions involve the Chen-Mangasarian class of smoothing functions and the smoothed Fischer-Bur...
متن کاملNon-interior Continuation Methods for Solving
There recently has been much interest in non-interior continuation/smoothingmethods for solving linear/nonlinear complementarity problems. We describe extensions of such methods to complementarity problems defined over the cone of block-diagonal symmetric positive semidefinite real matrices. These extensions involve the ChenMangasarian class of smoothing functions and the smoothed Fischer-Burme...
متن کاملSmoothing techniques for solving semidefinite programs with many constraints.dvi
We use smoothing techniques to solve approximately mildly structured semidefinite programs with many constraints. As smoothing techniques require a specific problem format, we introduce an alternative problem formulation that fulfills the structural assumptions. The resulting algorithm has a complexity that depends linearly both on the number of constraints and on the inverse of the accuracy. S...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 14 شماره
صفحات -
تاریخ انتشار 2004